Forking and Dividing in Continuous Logic

نویسنده

  • GABRIEL CONANT
چکیده

We investigate an open question concerning properties of algebraic independence in continuous theories (see Section 4). The rest of the work is essentially a translation to continuous logic of popular notions of independence (in particular, forking and dividing). Much of the time we are simply “copying” classical proofs from well-known sources, while along the way making the necessary adjustments for continuous languages. 1. Forking and Dividing We assume that the reader is familiar with the construction of continuous languages and theories of metric structures. A full introduction to these concepts can be found in [2]. We begin with the usual definition of dividing, which does not need to be altered to work in the continuous setting. Definition 1.1. A partial type π(x, b) divides over C if there is a C-indiscernible sequence (bi)i<ω, with b0 ≡C b, such that ⋃

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forking and Dividing in Henson Graphs

For n ≥ 3, define Tn to be the theory of the generic Kn-free graph, where Kn is the complete graph on n vertices. We prove a graph theoretic characterization of dividing in Tn, and use it to show that forking and dividing are the same for complete types. We then give an example of a forking and nondividing formula. Altogether, Tn provides a counterexample to a recent question of Chernikov and K...

متن کامل

Thorn-forking as Local Forking

We introduce the notion of a preindependence relation between subsets of the big model of a complete first-order theory, an abstraction of the properties which numerous concrete notions such as forking, dividing, thorn-forking, thorn-dividing, splitting or finite satisfiability share in all complete theories. We examine the relation between four additional axioms (extension, local character, fu...

متن کامل

Thorn-forking in continuous logic

We study thorn forking and rosiness in the context of continuous logic. We prove that the Urysohn sphere is rosy (with respect to finitary imaginaries), providing the first example of an essentially continuous unstable theory with a nice notion of independence. In the process, we show that a real rosy theory which has weak elimination of finitary imaginaries is rosy with respect to finitary ima...

متن کامل

Forking and dividing in NTP₂ theories

We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and dividing over models are the same, and in fact over any extension base. As an application we show that dependence is equivalent to bounded forking assuming NTP2.

متن کامل

Properly forking formulas in Urysohn spaces

In this informal note, we demonstrate the existence of forking and nondividing formulas in continuous theory of the complete Urysohn sphere, as well as the discrete theories of the integral Urysohn spaces of diameter n (where n ≥ 3). Whether or not such formulas existed was asked in thesis work of the author, as well as joint work with Terry. We also show an interesting phenomenon in that, for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013